Random Walks and Effective Resistances on Toroidal and Cylindrical Grids
نویسنده
چکیده
A mapping between random walk problems and resistor network problems is described and used to calculate the effective resistance between any two nodes on an infinite twodimensional square lattice of unit resistors. The superposition principle is then used to find effective resistances on toroidal and cylindrical square lattices.
منابع مشابه
Note on "Average resistance of toroidal graphs" by Rossi, Frasca and Fagnani
In our recent paper W.S. Rossi, P. Frasca and F. Fagnani, “Average resistance of toroidal graphs”, SIAM Journal on Control and Optimization, 53(4):2541–2557, 2015, we studied how the average resistances of d-dimensional toroidal grids depend on the graph topology and on the dimension of the graph. Our results were based on the connection between resistance and Laplacian eigenvalues. In this not...
متن کاملDeterministic walks with choice
This paper studies deterministic movement over toroidal grids, integrating local information, bounded memory and choice at individual nodes. The research is motivated by recent work on deterministic random walks, and applications in multi-agent systems. Several results regarding passing tokens through toroidal grids are discussed, as well as some open questions.
متن کاملOn the ratio between maximum weight perfect matchings and maximum weight matchings in grids
Given a graph G that admits a perfect matching, we investigate the parameter η(G) (originally motivated by computer graphics applications) which is defined as follows. Among all nonnegative edge weight assignments, η(G) is the minimum ratio between (i) the maximum weight of a perfect matching and (ii) the maximum weight of a general matching. In this paper, we determine the exact value of η for...
متن کاملRandom Walks and Foster’s Resistance Theorem
Given any simple connected graph G =< V,E > such that each edge e ∈ E has unit resistance, Foster’s Resistance Theorem states that the summation of effective resistances over all edges equals n− 1. That is, ∑ e∈E Re = n− 1 Further, given a general graph with resistances re corresponding to edges e ∈ E, the theorem states: ∑ e∈E Re re = n− 1 Tetali[1] proved Foster’s Resistance Theorem by consid...
متن کاملMany-to-many two-disjoint path covers in cylindrical and toroidal grids
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004